Attribute Grammars and Automatic Complexity Analysis Attribute Grammars and Automatic Complexity Analysis Attribute Grammars and Automatic Complexity Analysis
نویسندگان
چکیده
Decomposable combinatorial structures have been well studied and a systematic manner for determining generating function equations is well known. Attribute grammars have enhanced the study of context-free grammars by giving meaning to constructions. Delest and F edou 2] showed that attribute grammars extend to combinatorial structures, with applications to random generation. In a similar way, we show attribute grammars can be deened for the family of decompo-sable structures and yield multivariate generating function equations. From there, averages and higher moments are easily accessible. This idea uniies previous approaches to the analysis of parameters of data-structures. Grammaires attribu ees et analyse automatique de complexit e R esum e : Les structures decomposables sont bien etudi ees, et une m ethode sys-tematique permettant d'obtenir des equations de fonctions g en eratrices est bien connue. Les grammaires attribu ees permettent de donner une signiication aux constructions des grammaires context-free. Delest et F edou ont montr e que les grammaires attribu ees s' etendent a certaines structures combinatoires, avec des applications a la g en eration al eatoire. De mani ere semblable, nous montrons que des grammaires attribu ees peuvent ^ etre deenies pour la famille des structures decom-posables, ce qui donne lieu a des equations de fonctions g en eratrices multivari ees. De ll a, moyennes et autres moments sont ais ement accessibles. Cett id ee uniie les approches pr ec edentes a l'analyse de param etres des structures de donn ees. Abstract. Decomposable combinatorial structures have been well studied and a systematic manner for determining generating function equations is well known. Attribute grammars have enhanced the study of context-free grammars by giving meaning to constructions. Delest and F edou 2] showed that attribute grammars extend to combinatorial structures, with applications to random generation. In a similar way, we show attribute grammars can be deened for the family of de-composable structures and yield multivariate generating function equations. From there, averages and higher moments are easily accessible. This idea uniies previous approaches to the analysis of parameters of data-structures.
منابع مشابه
Attribute Grammars and Automatic Complexity Analysis
Attribute grammars provide a concise way to describe traits of a wide family of structures. Structures defined by context free grammars have been well studied by Delest, Fédou and more recently by Duchon. One of the principle benefits of this approach is the easy access to multivariate generating function equations from which average and higher moments are easily accessible. This work extends t...
متن کاملEmbedding attribute grammars and their extensions using functional zippers
Embedding Attribute Grammars and their Extensions using Functional Zippers Attribute grammars are a suitable formalism to express complex software language analysis and manipulation algorithms, which rely on multiple traversals of the underlying syntax tree. Attribute Grammars have been extended with mechanisms such as references, higher order and circular attributes. Such extensions provide a ...
متن کاملMulti-Plan Attribute Grammars
We identify a new class of non-circular attribute grammars, called the multi-plan attribute grammars, for which static evaluation plans can be computed. The class of multi-plan attribute grammars is larger than all currently known classes of non-circular attribute grammars with static evaluation plans. The decision procedure and the procedure for computing evaluation plans take essentially poly...
متن کاملPasses and Paths of Attributive Grammars
An attribute grammar is pure (left-to-right) multi-pass if a bounded number of left-to-right passes over the derivation tree suffice to compute all its attributes. There is no requirement, as for the usual multi-pass attribute grammars, that all occurrences of the same attribute are computed in the same pass, R is shown that the problem of determining whether an arbitrary attribute grammar is p...
متن کاملExploiting Attribute Grammars to Achieve Automatic Tupling
Tupling of function results is a well-known technique in functional programming to avoid multiple traversals over the same data. When expressing these programs as attribute grammars, function results are expressed as shared attributes for which tupling is done automatically. In this paper we show how we can get tupling for free by using attribute grammars as an intermediate language. We evaluat...
متن کامل